On pseudorandom numbers from multivariate polynomial systems
نویسندگان
چکیده
منابع مشابه
Multivariate permutation polynomial systems and nonlinear pseudorandom number generators
In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques studied previously for inversive generators, we bound exponential sums along the orbits of these dynamical systems and show that they admit much stronger estima...
متن کاملIterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers
In this paper we present an extension of a result in [2] about a discrepancy bound for sequences of s-tuples of successive nonlinear multiple recursive congruential pseudorandom numbers of higher orders. The key of this note is based on linear properties of the iterations of multivariate polynomials.
متن کاملOn Generalized Inversive Congruential Pseudorandom Numbers
The inversive congruential method with prime modulus for generating uniform pseudorandom numbers has several very promising properties. Very recently, a generalization for composite moduli has been introduced. In the present paper it is shown that the generated sequences have very attractive statistical independence properties.
متن کاملOn multivariate polynomial interpolation
We provide a map Θ 7→ ΠΘ which associates each finite set Θ of points in C with a polynomial space ΠΘ from which interpolation to arbitrary data given at the points in Θ is possible and uniquely so. Among all polynomial spaces Q from which interpolation at Θ is uniquely possible, our ΠΘ is of smallest degree. It is also Dand scale-invariant. Our map is monotone, thus providing a Newton form for...
متن کاملSolving Multivariate Polynomial Systems and an Invariant from Commutative Algebra
The security of several post-quantum cryptosystems is based on the assumption that solving a system of multivariate (quadratic) polynomial equations p1 = · · · = pm = 0 over a finite field is hard. Such a system can be solved by computing a lexicographic Gröbner basis of the ideal (p1, . . . , pm). The most efficient algorithms for computing Gröbner bases, such as F4 and F5, transform the probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2010
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2010.05.002